A Finite-Difference Sieve to Count Paths and Cycles by Length
نویسندگان
چکیده
We present algorithms to count paths and cycles of a given length in a directed graph. The algorithms have time complexity O(2 n poly n) and space complexity O(poly n).
منابع مشابه
Characterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کامل3 1 Ju l 2 00 6 Permutations , cycles , and the pattern 2 – 13
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
متن کاملPermutations, Cycles and the Pattern 2-13
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
متن کاملInvestigation on the Capability of the Win Area Device in Automatic Granulation of Desert Pavement
Introduction: Pediments are vitally important geomorphological units. Desert pavement feature is used for their classification. The characteristics of desert pavements are a function of geomorphological conditions and have unique properties in terms of different granulation parameters. A variety of methods are employed to determine granulation. The most common method is the sieving test, in whi...
متن کاملKinetic theory of random graphs: from paths to cycles.
The structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically. At the gelation point, the typical length of paths and cycles, l , scales with the component size k as l approximately k(1/2) . Dynamic and finite-size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 60 شماره
صفحات -
تاریخ انتشار 1996